Erratum: A guided tabu search for the heterogeneous vehicle routeing problem
نویسندگان
چکیده
منابع مشابه
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
The article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the customers, and carried out by a fleet of vehicles based at a central depot. In ...
متن کاملA tabu search algorithm for the vehicle routing problem
The purpose of this study is to develop a new tabu seach heuristic to solve the single-depot vehicle routing problem of a distribution company carrying goods from a depot to a set of dedicated dealers. The heuristic proposes a new neighbourhood generation procedure which considers the scattering pattern in the locations of the dealers. A set of neighbours are generated by first executing a proc...
متن کاملA Guided Cooperative Parallel Tabu Search for the Capacitated Vehicle Routing Problem
This paper presents a guided cooperative parallel tabu search algorithm for solving the capacitated vehicle routing problem. In the proposed algorithm, knowledge is extracted from the previously found solutions and applied to guide the diversification and intensification of individual search threads. The computational experiments on two sets of large scale benchmark instances show that the prop...
متن کاملA Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints
We present a metaheuristic methodology for the Capacitated Vehicle Routing Problem with two-dimensional loading constraints (2LCVRP). 2L-CVRP is a generalisation of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of twodimensional, rectangular, weighted items. The purpose of this problem is to produce the minimum cost routes, starting and terminating at a ce...
متن کاملA tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2008
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2602539